package com.algorithm.dp;

/**
 * 爬楼梯
 *
 * @author Amadeus
 * @date 2023/10/20
 */
public class climbStairs {

    public static int climbStairs(int n) {
        if (n <= 2) {
            return n;
        }

        int[] dp = new int[n + 1];
        dp[1] = 1;
        dp[2] = 2;

        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }

        return dp[n];
    }

    public static void main(String[] args) {
        System.out.println(climbStairs(7));
    }

}
